Superlinear convergence of a class of θ-bounded rank-one update methods

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the convergence of a Greedy Rank-One Update Algorithm for a class of linear systems

Abstract In this paper we study the convergence of the well-known Greedy RankOne Update Algorithm. It is used to construct the rank-one series solution for fullrank linear systems. The existence of the rank one approximations is also not new, but surprisingly the focus there has been more on the applications side more that in the convergence analysis. Our main contribution is to prove the conve...

متن کامل

Superlinear Convergence of Conjugate Gradients

We give a theoretical explanation for superlinear convergence behavior observed while solving large symmetric systems of equations using the conjugate gradient method or other Krylov subspace methods. We present a new bound on the relative error after n iterations. This bound is valid in an asymptotic sense when the size N of the system grows together with the number of iterations. The bound de...

متن کامل

Convergence of quasi-Newton matrices generated by the symmetric rank one update

Quasi-Newton algorithms for unconstrained nonlinear minimization generate a sequence of matrices that can be considered as approximations of the objective function second derivatives. This paper gives conditions under which these approximations can be proved to converge globally to the true Hessian matrix, in the case where the Symmetric Rank One update formula is used. The rate of convergence ...

متن کامل

Convergence of quasi-Newton matrices generated by the symmetric rank one update

Quasi-Newton algorithms for unconstrained nonlinear minimization generate a sequence of matrices that can be considered as approximations of the objective function second derivatives. This paper gives conditions under which these approximations can be proved to converge globally to the true Hessian matrix, in the case where the Symmetric Rank One update formula is used. The rate of convergence ...

متن کامل

Bounded Rank-one Perturbations in Sampling Theory

Sampling theory concerns the problem of reconstruction of functions from the knowledge of their values at some discrete set of points. In this paper we derive an orthogonal sampling theory and associated Lagrange interpolation formulae from a family of bounded rank-one perturbations of a self-adjoint operator that has only discrete spectrum of multiplicity one. Mathematics Subject Classificatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 1993

ISSN: 0893-9659

DOI: 10.1016/0893-9659(93)90150-l